Finite sample effects of the fast ICA algorithm

نویسنده

  • Sergio Bermejo
چکیده

Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y), which expresses the decorrelation of the components and G(Y), which measures their non-Gaussianity. Within this framework, the popular FastICA algorithm can be regarded as a technique that keeps C(Y) 1⁄4 0 by first enforcing the whiteness of Y. Because of this constraint, the standard version of FastICA employs the sample-fourth moment as G(Y), instead of the sample-fourth cumulant. Our work analyzes some of the estimation errors introduced by the use of finite date sets in such a higher-order statistics (HOS) contrast and compares FastICA with an alternative version based on the sample-fourth cumulant, which is shown for different probability distributions having a lower variance in the generalization error in the case in which no whitening is performed, e.g. when orthonormal mixing of sources is present. r 2007 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Performance of ICA Algorithm for fMRI Simulated Data Analysis Using Temporal and Spatial Filters in the Preprocessing Phase

Introduction: The accuracy of analyzing Functional MRI (fMRI) data is usually decreases in the presence of noise and artifact sources. A common solution in for analyzing fMRI data having high noise is to use suitable preprocessing methods with the aim of data denoising. Some effects of preprocessing methods on the parametric methods such as general linear model (GLM) have previously been evalua...

متن کامل

A New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA

Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...

متن کامل

A Novel Optimization Approach Applied to Multi-Pass Turning Process

Optimization of turning process is a non-linear optimization with constrains and it is difficult for the conventional optimization algorithms to solve this problem. The purpose of present study is to demonstrate the potential of Imperialist Competitive Algorithm (ICA) for optimization of multipass turning process. This algorithm is inspired by competition mechanism among imperialists and coloni...

متن کامل

A Novel Optimization Approach Applied to Multi-Pass Turning Process

Optimization of turning process is a non-linear optimization with constrains and it is difficult for the conventional optimization algorithms to solve this problem. The purpose of present study is to demonstrate the potential of Imperialist Competitive Algorithm (ICA) for optimization of multipass turning process. This algorithm is inspired by competition mechanism among imperialists and coloni...

متن کامل

A NEW HYBRID ALGORITHM FOR TOPOLOGY OPTIMIZATION OF DOUBLE LAYER GRIGS

In this paper, for topology optimization of double layer grids, an efficient optimization method is presented by combination of Imperialist Competitive Algorithm (ICA) and Gravitational Search Algorithm (GSA) which is called ICA-GSA method. The present hybrid method is based on ICA but the moving of countries toward their relevant imperialist is done using the la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2007